Mod-φ Convergence
نویسندگان
چکیده
Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the winding number of complex brownian motion and the classical situation of the central limit theorem, and a conjecture concerning the distribution of values of the Riemann zeta function on the critical line.
منابع مشابه
Some results on convergence and existence of best proximity points
In this paper, we introduce generalized cyclic φ-contraction maps in metric spaces and give some results of best proximity points of such mappings in the setting of a uniformly convex Banach space. Moreover, we obtain convergence and existence results of proximity points of the mappings on reflexive Banach spaces
متن کاملThe Fourth Moment of Dirichlet L-functions
Here ∑∗ denotes summation over primitive characters χ (mod q), φ(q) denotes the number of primitive characters (mod q), and ω(q) denotes the number of distinct prime factors of q. Note that φ(q) is a multiplicative function given by φ(p) = p − 2 for primes p, and φ(p) = p(1 − 1/p) for k ≥ 2 (see Lemma 1 below). Also note that when q ≡ 2 (mod 4) there are no primitive characters (mod q), and so ...
متن کاملA New Notion of Cardinality for Countable First Order Theories
We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Φ|| for sentences Φ of Lω1,ω, which counts the number of sentences of L∞,ω that, in some forcing extension, become a canonical Scott sentence of a model of Φ. We show this card...
متن کاملBorel Complexity and Potential Canonical Scott Sentences
We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Φ|| for sentences Φ of Lω1,ω, which counts the number of sentences of L∞,ω that, in some forcing extension, become a canonical Scott sentence of a model of Φ. We show this card...
متن کاملOne Modulo Three Mean Labeling of Graphs
In this paper, we introduce a new labeling called one modulo three mean labeling. A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a | 0 ≤ a ≤ 3q2 and either a≡0(mod 3) or a≡1(mod 3) } where q is the number of edges of G and φ induces a bijection φ * from the edge set of G to { } |1 3 2 and ( 3) a a q a 1 mod ≤ ≤ − ≡ gi...
متن کامل